On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree
نویسندگان
چکیده
منابع مشابه
On Size Ramsey Numbers of Graphs with Bounded Degree
Answering a question of J. Beck B2], we prove that there exists a graph G on n vertices with maximum degree three and the size Ramsey number ^ r(G) cn(log n) where and c are positive constants. For graphs G and F, write F ! G to mean that if the edges of F are colored by red and blue, then F contains a monochromatic copy of G. Erd} os, Faudree, Rousseau and Schelp EFRS] were the rst to consider...
متن کاملOn ordered Ramsey numbers of bounded-degree graphs
An ordered graph is a pair G = (G,≺) where G is a graph and ≺ is a total ordering of its vertices. The ordered Ramsey number R(G) is the minimum number N such that every ordered complete graph with N vertices and with edges colored by two colors contains a monochromatic copy of G. We show that for every integer d ≥ 3, almost every d-regular graph G satisfies R(G) ≥ n3/2−1/d 4 log n log log n fo...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملA transference principle for Ramsey numbers of bounded degree graphs
We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that there exists a constant c such that for every ∆, there exists β such that if G is an n-vertex graph with maximum degree at most ∆ having a homomorphism f into a...
متن کاملInduced-Universal Graphs for Graphs with Bounded Maximum Degree
For a family F of graphs, a graph U is induced-universal for F if every graph in F is an induced subgraph of U . We give a construction for an induceduniversal graph for the family of graphs on n vertices with degree at most r, which has Cnb(r+1)/2c vertices and Dn2b(r+1)/2c−1 edges, where C and D are constants depending only on r. This construction is nearly optimal when r is even in that such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1996
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0025